منابع مشابه
Approximate Bit Vectors for Fast Unification
Bit vectors provide a way to compute the existence of least upper bounds in partial orders, which is a fundamental operation needed by any unificationbased parser. However, bit vectors have seen relatively little adoption because of their length and associated speed disadvantages. We present a novel bit vector technique based on allowing one-sided errors; the resulting approximate bit vectors c...
متن کاملProper Noun Semantic Clustering Using Bag-of-Vectors
In this paper, we propose a model for semantic clustering of entities extracted from a text, and we apply it to a Proper Noun classification task. This model is based on a new method to compute the similarity between the entities. Indeed, the classical way of calculating similarity is to build a feature vector or Bag-of-Features for each entity and then use classical similarity functions like C...
متن کاملMatchsimile: a Flexible Approximate Matching Tool for Searching Proper Name
We present the architecture and algorithms behind Matchsimile, an approximate string matching lookup tool especially designed for extracting person and company names from large texts. Part of a larger information extraction environment, this specific engine receives a large set of proper names to search for, a text to search, and search options; and outputs all the occurrences of the names foun...
متن کاملLocal Clustering of Large Graphs by Approximate Fiedler Vectors
We address the problem of determining the natural neighbourhood of a given node i in a large nonunifom network G in a way that uses only local computations, i.e. without recourse to the full adjacency matrix of G. We view the problem as that of computing potential values in a diffusive system where node i is fixed at zero potential, and the potentials at the other nodes are then induced by the ...
متن کاملApproximate Clustering of Fingerprint Vectors with Missing Values
The problem of clustering ngerprint vectors is an interesting problem in Computational Biology that has been proposed in [6]. In this paper we show some improvements in closing the gaps between the known lower bounds and upper bounds on the approximability of some variants of the biological problem. Namely we are able to prove that the problem is APXhard even when each ngerprint contains only t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1962
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1962-0133690-8